Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval

We determine the exact range of the smallest and largest eigenvalues of real symmetric matrices of a given order whose entries are in a given interval. The maximizing and minimizing matrices are specified. We also consider the maximal spread of such matrices.

متن کامل

Eigenvalues of symmetric tridiagonal interval matrices revisited

In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.

متن کامل

Inverses, determinants, eigenvalues, and eigenvectors of real symmetric Toeplitz matrices with linearly increasing entries

We explicitly determine the skew-symmetric eigenvectors and corresponding eigenvalues of the real symmetric Toeplitz matrices T = T (a, b, n) := (a+ b|j − k|)1≤j,k≤n of order n ≥ 3 where a, b ∈ R, b 6= 0. The matrix T is singular if and only if c := a b = −n−1 2 . In this case we also explicitly determine the symmetric eigenvectors and corresponding eigenvalues of T . If T is regular, we explic...

متن کامل

Extreme eigenvalues of real symmetric Toeplitz matrices

We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations. We also present a concise convergence analysis for a method to solve these spectral equations, along with an efficient stopping rule, an error analysis, and extensive numerical results.

متن کامل

Real symmetric matrices 1 Eigenvalues and eigenvectors

A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2005

ISSN: 0895-4798,1095-7162

DOI: 10.1137/050627812